Proof Certificates for Algebra and Their Application to Automatic Geometry Theorem Proving

نویسندگان

  • Benjamin Grégoire
  • Loïc Pottier
  • Laurent Théry
چکیده

Integrating decision procedures in proof assistants in a safe way is a major challenge. In this paper, we describe how, starting from Hilbert’s Nullstellensatz theorem, we combine a modified version of Buchberger’s algorithm and some reflexive techniques to get an effective procedure that automatically produces formal proofs of theorems in geometry. The method is implemented in the Coq system but, since our specialised version of Buchberger’s algorithm outputs explicit proof certificates, it could be easily adapted to other proof assistants.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic verification and interactive theorem proving

Sommario. Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistant or interactive provers, provide an interactive environment for the creation of formal certificates whose correctness can be assessed in a purely automatic way. Such systems have applications both in mathematics, where certificates are pr...

متن کامل

KAT and PHL in Coq

In this article we describe an implementation of Kleene algebra with tests (KAT) in the Coq theorem prover. KAT is an equational system that has been successfully applied in program verification and, in particular, it subsumes the propositional Hoare logic (PHL). We also present an PHL encoding in KAT, by deriving its deduction rules as theorems of KAT. Some examples of simple program's formal ...

متن کامل

A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry

This paper presents a formalization of Grassmann-Cayley algebra [6] that has been done in the Coq [2] proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus’ and Desargues’ theorem [7,1] are interactively derived....

متن کامل

RALL: Machine-Supported Proofs for Relation Algebra

We present a theorem proving system for abstract relation algebra called RALL Relation Algebraic Language and Logic based on the generic theorem prover Isabelle On the one hand the system is an advanced case study for Isabelle HOL and on the other hand a quite mature proof assistant for research on the relational calculus RALL is able to deal with the full language of heterogeneous relation alg...

متن کامل

Qualitative Theorem Proving in Linear Constraints

We know, from the classical work of Tarski on real closed elds, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008